On the Index 2 Spectra of Bipartite Subgraphs of 2 K 4
نویسندگان
چکیده
Let Kn denote the complete 2-fold multigraph of order n and let G be a bipartite subgraph of K4. We find necessary and sufficient conditions for the existence of a G-decomposition of Kn.
منابع مشابه
Mixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملRamsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs
Geometric versions of Ramsey-type and Turán-type problems are studied in a special but natural representation of bipartite graphs and similar questions are asked for general representations. A bipartite geometric graphG(m,n) = [A,B] is simple if the vertex classes A,B of G(m,n) are represented in R2 as A = {(1, 0), (2, 0), . . . , (m, 0)}, B = {(1, 1), (2, 1), . . . , (n, 1)} and the edge ab is...
متن کاملPartitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کامل